Supporting Lemmas for RISE-based Control Methods
نویسندگان
چکیده
A class of continuous controllers termed Robust Integral of the Signum of the Error (RISE) have been published over the last decade as a means to yield asymptotic convergence of the tracking error for classes of nonlinear systems that are subject to exogenous disturbances and/or modeling uncertainties. The development of this class of controllers relies on a property related to the integral of the signum of an error signal. A proof for this property is not available in previous literature. The stability of some RISE controllers is analyzed using differential inclusions. Such results rely on the hypothesis that a set of points is Lebesgue negligible. This paper states and proves two lemmas related to the properties.
منابع مشابه
Technische Universit at M U N C H E N Institut F Ur Informatik Similarity-based Lemma Generation with Lemma-delaying Tableaux Enumeration 1997 Sfb 342 Methoden Und Werkzeuge F Ur Die Nutzung Paralleler Architekturen Similarity-based Lemma Generation with Lemma-delaying Tableaux Enumeration
The use of bottom-up generated lemmas is an appropriate method for achieving an eeective redundancy control mechanism for connection tableau search procedures as well as for reducing proof lengths. An unbounded use of lemmas, however, usually does not lead to improvements of the search process and can even complicate the search. In order to identify lemmas which are actually relevant for the pr...
متن کاملLearning-assisted theorem proving with millions of lemmas☆
Large formal mathematical libraries consist of millions of atomic inference steps that give rise to a corresponding number of proved statements (lemmas). Analogously to the informal mathematical practice, only a tiny fraction of such statements is named and re-used in later proofs by formal mathematicians. In this work, we suggest and implement criteria defining the estimated usefulness of the ...
متن کاملGenerating Lemmas for Tableau-based Proof Search Using Genetic Programming
Top-down or analytical provers based on the connection tableau calculus are rather powerful, yet have notable shortcomings regarding redundancy control. A well-known and successful technique for alleviating these shortcomings is the use of lemmas. We propose to use genetic programming to evolve useful lemmas through an interleaved process of top-down goal decomposition and bottomup lemma genera...
متن کاملEnhancing Inductive Entailment Proofs in Separation Logic with Lemma Synthesis
This paper presents an approach to lemma synthesis to support advanced inductive entailment procedures based on separation logic. We first propose a mechanism where lemmas are automatically proven and systematically applied. Our lemmas may include universal guard and/or unknown predicate. While the former is critical for expressivity, the latter is essential for supporting relationships between...
متن کاملFundamental lemmas for the determination of optimal control strategies for a class of single machine family scheduling problems
Four lemmas, which constitute the theoretical foundation necessary to determine optimal control strategies for a class of single machine family scheduling problems, are presented in this technical report. The scheduling problem is characterized by the presence of sequence-dependent batch setup and controllable processing times; moreover, the generalized due-date model is adopted in the problem....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1306.3432 شماره
صفحات -
تاریخ انتشار 2013